The Irregularity and Modular Irregularity Strength of Fan Graphs
نویسندگان
چکیده
For a simple graph G with no isolated edges and at most, one vertex, labeling ?:E(G)?{1,2,…,k} of positive integers to the is called irregular if weights vertices, defined as wt?(v)=?u?N(v)?(uv), are all different. The irregularity strength known maximal integer k, minimized over labelings, set ? such exists. In this paper, we determine exact value modular fan graphs.
منابع مشابه
The irregularity and total irregularity of Eulerian graphs
For a graph G, the irregularity and total irregularity of G are defined as irr(G)=∑_(uv∈E(G))〖|d_G (u)-d_G (v)|〗 and irr_t (G)=1/2 ∑_(u,v∈V(G))〖|d_G (u)-d_G (v)|〗, respectively, where d_G (u) is the degree of vertex u. In this paper, we characterize all connected Eulerian graphs with the second minimum irregularity, the second and third minimum total irregularity value, respectively.
متن کاملIrregularity strength of dense graphs
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) → {1, 2, . . . , w}. For a vertex v, f(v) is defined as the sum f(e) over all edges e of G incident with v. f is called irregular, if all f(v) are distinct. The smallest w for which there exists an irregular assignment on G is called the irreg...
متن کاملIrregularity Strength of Regular Graphs
Let G be a simple graph with no isolated edges and at most one isolated vertex. For a positive integer w, a w-weighting of G is a map f : E(G) → {1, 2, . . . , w}. An irregularity strength of G, s(G), is the smallest w such that there is a w-weighting of G for which ∑
متن کاملProduct irregularity strength of graphs
Consider a simple graph G with no isolated edges and at most one isolated vertex. A labeling w : E(G) → {1, 2, . . . ,m} is called product-irregular, if all product degrees pdG(v) = ∏ e3v w(e) are distinct. The goal is to obtain a product-irregular labeling that minimizes the maximum label. This minimum value is called the product irregularity strength. The analogous concept of irregularity str...
متن کاملThe irregularity strength of circulant graphs
The irregularity strength of a simple graph is the smallest integer k for which there exists a weighting of the edges with positive integers at most k such that all the weighted degrees of the vertices are distinct. In this paper we study the irregularity strength of circulant graphs of degree 4. We find the exact value of the strength for a large family of circulant graphs. © 2005 Elsevier B.V...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2021
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym13040605